منابع مشابه
The p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملhybrid harmony search for conditional p-median problems
in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.
متن کاملApproximate Solving of Large p-Median Problems
This paper deals with an approximate approach to the p-median problem. Large instances of the p-median problem can be often met when a real public service system is designed and the discomfort of its customers is minimized. If a large instance of the p-median problem is described by a location-allocation model, then the size of a model often exceeds the acceptable limit for available optimizati...
متن کاملVisOpt: a visual interactive optimization tool for P-median problems
1 School of Management, The University of Texas at Dallas, Richardson, Texas. email: [email protected] 2 Department of Management, Oklahoma State University, Stillwater Ok, 74078 email: [email protected] 3 Department of Accounting and MIS, The Ohio State University, Columbus, Ohio 43210 email: [email protected] Abstract. In this paper we describe a visual interactive decision...
متن کاملA Hybrid Data Mining Metaheuristic for the p-Median Problem
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In this work, we propose a hybrid version of the GRASP metaheuristic, which incorporates a data mining process, to solve the p-median problem. We believe that patterns obtained by a data mining technique, from a set of sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2009
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-009-9251-8